Spike artifact reduction in nonconvex Compressed Sensing
نویسندگان
چکیده
Compressed sensing (CS), a reconstruction method for undersampled MR data, was recently introduced [1]. Since only undersampled data are acquired, CS allows a significant reduction in the time needed for MR experiments. The basic requirement for CS, however, is sparsity in the data. The lack of F background signal in living tissue leads to an intrinsically sparse signal distribution in the F image domain. This makes F MR a suitable application for CS [2]. However, F MR data often suffers from a low SNR, which is problematic for CS. Thus, spike artifacts often appear highly pronounced especially in nonconvex CS reconstructions of noisy F MR data. The present study focuses on the reduction of spike artifacts in these CS reconstructions. Therefore, a post-processing "de-spike algorithm" is proposed, using the fact that the spatial position of spike artifacts depends on the chosen sampling pattern. Numerical phantom simulations as well as exand in-vivo F CSI experiments were performed.
منابع مشابه
Compressed Sensing Recovery via Nonconvex Shrinkage Penalties
The ` minimization of compressed sensing is often relaxed to `, which yields easy computation using the shrinkage mapping known as soft thresholding, and can be shown to recover the original solution under certain hypotheses. Recent work has derived a general class of shrinkages and associated nonconvex penalties that better approximate the original ` penalty and empirically can recover the ori...
متن کاملA Combination of Nonconvex Compressed Sensing and GRAPPA (CS-GRAPPA)
Introduction Compressed Sensing (CS) (e.g. [1]) is a novel approach to reconstruct sparse undersampled datasets. Several papers (e.g. [2]) have demonstrated the benefit of CS in the field of MRI. Nonconvex CS [3] is a more recent development which allows for even higher acceleration factors and is easy to implement. A first application for dynamic cardiac imaging has been demonstrated [4]. Howe...
متن کاملSparse signal recovery by $\ell_q$ minimization under restricted isometry property
In the context of compressed sensing, the nonconvex lq minimization with 0 < q < 1 has been studied in recent years. In this paper, by generalizing the sharp bound for l1 minimization of Cai and Zhang, we show that the condition δ(sq+1)k < 1
متن کاملReference Information Based Remote Sensing Image Reconstruction with Generalized Nonconvex Low-Rank Approximation
Because of the contradiction between the spatial and temporal resolution of remote sensing images (RSI) and quality loss in the process of acquisition, it is of great significance to reconstruct RSI in remote sensing applications. Recent studies have demonstrated that reference image-based reconstruction methods have great potential for higher reconstruction performance, while lacking accuracy ...
متن کاملCompressed Sampling for Spike Sorting
Our goal is to demonstrate the usefulness and efficiency of a compressed sensing approach when applied to the problem of spike sorting. This approach involves four steps towards transforming the raw spikes into a sparse basis with the fewest number of measurements require to achieve accurate clustering. We first train a dictionary which converts a spike into a sparse signal. We then sample the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009